BISIMULATOR: A Modular Tool for On-the-Fly Equivalence Checking
نویسندگان
چکیده
منابع مشابه
Distributed On-the-Fly Equivalence Checking
On-the-fly equivalence checking consists in comparing two Labeled Transition Systems (Ltss) modulo a given equivalence relation by exploring them in a demanddriven way. Since it avoids the explicit construction of Ltss, this method is able to detect errors even in systems that are too large to fit in the memory of a computer. In this paper, we aim at further improving the performance of on-the-...
متن کاملImproved On-the-Fly Equivalence Checking Using Boolean Equation Systems
Equivalence checking is a classical verification method for ensuring the compatibility of a finite-state concurrent system (protocol) with its desired external behaviour (service) by comparing their underlying labeled transition systems (Ltss) modulo an appropriate equivalence relation. The local (or on-the-fly) approach for equivalence checking combats state explosion by exploring the synchron...
متن کاملFormal Verification Based on Relation Checking in SPIN: A Case Study
A case study in formal verification of concurrent/distributed software is presented. The study concerns the modular specification and verification of a remote task protocol. The verification methodology used is based on semantic equivalence checking and is applicable to systems with hierarchical architectures. To support the methodology, we extended the verification tool Spin with the ability t...
متن کاملAlternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one hand, concepts like loops and elementary sets have been proposed in order to extend Clark’s completion for computing answer sets of logic programs by means of propositional logic. On the other hand, different concepts...
متن کاملModular Minimization of Deterministic Finite State Machines
This work presents a modular technique for minimizing a deterministic nite state ma chine FSM while preserving its equivalence to the original system Being modular the minimization technique should consume less time and space Preserving equivalence the resulting minimized model can be employed in both temporal logic model checking and sequential equivalence checking thus reducing their time and...
متن کامل